منابع مشابه
On the order of the largest induced tree in a random graph
Consider a random graph K(n,p) with n labeled vertices in which the edges are chosen independently and with a probability p. Let Tn(p) be the order of the largest induced tree in K(n, p). Among other results it is shown, using an algorithmic approach, that if p = (c log n)/n, where c_>e is a constant, then for any fixed e>0 logn / logn almost surely.
متن کاملThe Largest Component in a Subcritical Random Graph with a Power Law Degree Distribution
It is shown that in a subcritical random graph with given vertex degrees satisfying a power law degree distribution with exponent γ > 3, the largest component is of order n. More precisely, the order of the largest component is approximatively given by a simple constant times the largest vertex degree. These results are extended to several other random graph models with power law degree distrib...
متن کاملThe order of the largest complete minor in a random graph
Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let Gn;p denote a random graph on n vertices with edge probability p. Bollob as, Catlin and Erd} os [5] asymptotically determined ccl(Gn;p) when p is a constant. Luczak, Pittel and Wierman [10] gave bounds on ccl(Gn;p) when p is very close to 1=n, i.e. inside the phase transiti...
متن کاملA tight bound of the largest eigenvalue of sparse random graph
We analyze the largest eigenvalue and eigenvector for the adjacency matrices of sparse random graph. Let λ1 be the largest eigenvalue of an n-vertex graph, and v1 be its corresponding normalized eigenvector. For graphs of average degree d log n, where d is a large enough constant, we show λ1 = d log n + 1 ± o(1) and 〈1, v1〉 = √ n ( 1−Θ ( 1 logn )) . It shows a limitation of the existing method ...
متن کاملThe Largest Component in an Inhomogeneous Random Intersection Graph with Clustering
Given integers n and m = ⌊βn⌋ and a probability measure Q on {0, 1, . . . ,m}, consider the random intersection graph on the vertex set [n] = {1, 2, . . . , n} where i, j ∈ [n] are declared adjacent whenever S(i)∩S(j) 6= ∅. Here S(1), . . . , S(n) denote the iid random subsets of [m] with the distribution P(S(i) = A) = (m |A| −1 Q(|A|), A ⊂ [m]. For sparse random intersection graphs, we establi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1983
ISSN: 0304-3975
DOI: 10.1016/0304-3975(83)90034-8